منابع مشابه
Shortest-Path Indices: Establishing a Methodology for Shortest-Path Problems
During the last years, impressive progress has been achieved in the field of algorithm engineering. A problem becoming more and more important is that of data dependency: the performance of an algorithm often highly depends on the input. Yet, for a given input, it is highly non-trivial to select the best solving strategy. In this work, we introduce a new methodology for evaluating speed-up tech...
متن کاملShortest Path
In this lecture, we will further examine shortest path algorithms. We will first revisit Dijkstra’s algorithm and prove its correctness. Next, we will look at another shortest path algorithm known as the Bellman-Ford algorithm, that has a slower running time than Dijkstra’s but allows us to compute shortest paths on graphs with negative edge weights. Lastly, we look at an O(n3)-time algorithm f...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملSecluded Path via Shortest Path
We provide several new algorithmic results for the secluded path problem, specifically approximation and optimality results for the static algorithm of [3, 5], and an extension (h-Memory) of it based on de Bruijn graphs, when applied to bounded degree graphs and some other special graph classes which can model wireless communication and line-of-sight settings. Our primary result is that h-Memor...
متن کاملAcceleration of Shortest Path and Constrained Shortest Path Computation
We study acceleration methods for point-to-point shortest path and constrained shortest path computations in directed graphs, in particular in road and railroad networks. Our acceleration methods are allowed to use a preprocessing of the network data to create auxiliary information which is then used to speed-up shortest path queries. We focus on two methods based on Dijkstra’s algorithm for sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review B
سال: 2003
ISSN: 0163-1829,1095-3795
DOI: 10.1103/physrevb.67.113201